std::priority_queue::top

From Cppreference

C++ Standard Library
Language Utilities library Strings library Containers library Algorithms library Iterators library Numerics library Input/output library Localizations library Regular expressions library (C++0x feature) Atomic operations library (C++0x feature) Thread support library (C++0x feature)
Containers library
array (C++0x feature) vector deque forward_list (C++0x feature) list set multiset map multimap unordered_set (C++0x feature) unordered_multiset (C++0x feature) unordered_map (C++0x feature) unordered_multimap (C++0x feature) stack queue priority_queue
std::priority_queue
Member functions priority_queue::priority_queue priority_queue::~priority_queue priority_queue::operator= Element access priority_queue::top Capacity priority_queue::empty priority_queue::size Modifiers priority_queue::push priority_queue::emplace priority_queue::pop priority_queue::swap

​reference top();​
​const_reference top() const;​

Returns reference to the top element in the priority queue. This element will be removed on a call to pop(). If default comparison function is used, the returned element is also the greatest among the elements in the queue.

Effectively calls ​c.back()​.

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

Parameters

(none)

Return value

reference to the top element

Complexity

constant

See also

pop	removes the first element (public member function)